The Complexity of Reversal-Bounded Model-Checking
نویسندگان
چکیده
We study model-checking problems on counter systems when the specification languages are LTL-like dialects with arithmetical constraints and the runs are restricted to reversal-bounded ones. To do so, we introduce a generalization of reversal-boundedness and we show the NExpTime-completeness of the reversal-bounded model-checking problem as well as for related reversal-bounded reachability problems. Guards in counter systems are quantifier-free Presburger formulae and the temporal logic is an extension of LTL with arithmetical constraints. As a by-product, we show the effective semilinearity for sets of configurations for which there is a reversal-bounded run verifying a given temporal formula. Not only our results generalize and refine numerous existing results about reversal-bounded counter automata but also it provides a uniform and more general framework.
منابع مشابه
Model Checking Recursive Programs with Numeric Data Types
Pushdown systems (PDS) naturally model sequential recursive programs. Numeric data types also often arise in real-world programs. We study the extension of PDS with unbounded counters, which naturally model numeric data types. Although this extension is Turingpowerful, reachability is known to be decidable when the number of reversals between incrementing and decrementing modes is bounded. In t...
متن کاملAlgorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a large family of classes of infinite systems. Such results normally start with a powerful formalism F of infinite-state systems, over which P is undecidable, ...
متن کاملModel Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of registers and on the use of propositional variables for control locations). The logic has the ability to...
متن کاملThe parameterized space complexity of model-checking bounded variable first-order logic
The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the length of the sentence. In 1995 Vardi observed a polynomial time algorithm deciding the model-checking problem for queries with a bounded number of variables. We study its parame...
متن کاملOn Liveness Verification of Reversal-bounded Multicounter Machines with a Free Counter
We investigate a number of Presburger liveness problems for nondeterministic reversal-bounded multicounter machines with a free counter (NCMFs). We show the following: – The -Presburger-i.o. problem and the -Presburger-eventual problem are both decidable. So are their duals, the -Presburger-almost-always problem and the -Presburger-always problem. – The -Presburger-i.o. problem and the -Presbur...
متن کامل